Capturing the experimental behaviour of a point-absorber WEC by simplified numerical models

The paper presents a wave basin experiment of a direct-driven point-absorber wave energy converter moving in six degrees of freedom. The goal of the work is to study the dynamics and energy absorption of the wave energy converter, and to verify under which conditions numerical models restricted to heave can capture the behaviour of a point-absorber moving in six degrees of freedom. Several regular and irregular long-crested waves and different damping values of the power take-off system have been tested. We collected data in terms of power output, device motion in six degrees of freedom and wave elevation at different points of the wave basin. A single-body numerical model in the frequency domain and a two-body model in the time domain are used in the study. Motion instabilities due to parametric resonance observed during the experiments are discussed and analysis of the buoy motion in terms of the Mathieu instability is also presented. Our results show that the simplified models can reproduce the body dynamics of the studied converter as long as the transverse non-linear instabilities are not excited, which typically is the case in irregular waves. The performance of the more complex time domain model is able to reproduce both the buoy and PTO dynamics, while the simpler frequency domain model can only reproduce the PTO dynamics for specific cases. Finally, we show that the two-body dynamics of the studied wave energy converter affects the power absorption significantly, and that common assumptions in the numerical models, such as stiff mooring line or that the float moves only in heave, may lead to incorrect predictions for certain sea states.     

Infinite family of transmission irregular trees of even order

Distance between two vertices is the number of edges in a shortest path connecting them in a connected graph $G$. The transmission of a vertex $v$ is the sum of distances from $v$ to all the other vertices of $G$. If transmissions of all vertices are mutually distinct, then $G$ is a transmission irregular graph. It is known that almost no graphs are transmission irregular. Infinite families of transmission irregular trees of odd order were presented in Alizadeh and Klav?ar (2018). The following problem was posed in Alizadeh and Klav?ar (2018): do there exist infinite families of transmission irregular trees of even order? In this article, such a family is constructed.     

Maximizing and minimizing the number of generalized colorings of trees

We classify the trees on $n$ vertices with the maximum and the minimum number of certain generalized colorings, including conflict-free, odd, non-monochromatic, star, and star rainbow vertex colorings. We also extend a result of Cutler and Radcliffe on the maximum and minimum number of existence homomorphisms from a tree to a completely looped graph on $q$ vertices.     

The Green polynomials via vertex operators

An iterative formula for the Green polynomial is given using the vertex operator realization of the Hall-Littlewood function. Based on this, (1) a general combinatorial formula of the Green polynomial is given; (2) several compact formulas are given for Green's polynomials associated with upper partitions of length ≤3 and the diagonal lengths ≤3; (3) a Murnaghan-Nakayama type formula for the Green polynomial is obtained; and (4) an iterative formula is derived for the bitrace of the finite general linear group G and the Iwahori-Hecke algebra of type A on the permutation module of G by its Borel subgroup.     

Positions of characters in finite groups and the Taketa inequality

We define the position of an irreducible complex character of a finite group as an alternative to the degree. We then use this to define three classes of groups: position reducible (PR)-groups, inductively position reducible (IPR)-groups and weak IPR-groups. We show that IPR-groups and weak IPR-groups are solvable and satisfy the Taketa inequality (ie, that the derived length of the group is at most the number of degrees of irreducible complex characters of the group), and we show that any M-group is a weak IPR-group. We also show that even though PR-groups need not be solvable, they cannot be perfect.